Search algorithm

Results: 1615



#Item
111Constraint programming / Operations research / Constraint satisfaction problem / Local consistency / Mathematical optimization / Heuristic / Integer programming / Constraint satisfaction / Search algorithm / Local search / Look-ahead / Decomposition method

Experimental evaluation of modern variable selection strategies in Constraint Satisfaction Problems Thanasis Balafoutis1 and Kostas Stergiou1 Department of Information & Communication Systems Engineering University of th

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2008-11-28 08:00:26
112Suffix tree / String searching algorithm / String / Generalized suffix tree / Trie / NP / Planted motif search

International Journal of Foundations of Computer Science c World Scientific Publishing Company ! A First Approach to Finding Common Motifs With Gaps COSTAS S. ILIOPOULOS∗

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Language: English - Date: 2008-10-22 02:35:22
113Search algorithms / Multivariate statistics / K-nearest neighbors algorithm / Nearest neighbor / Recommender system / Multidimensional scaling / Graph drawing / Heightmap / FM4 / Nintendo DS / Music information retrieval / Visualization

Proceedings of the SMC6th Sound and Music Computing Conference, 23-25 July 2009, Porto - Portugal FM4 SOUNDPARK AUDIO-BASED MUSIC RECOMMENDATION IN EVERYDAY USE Martin Gasser Austrian Research Institute

Add to Reading List

Source URL: smcnetwork.org

Language: English - Date: 2011-03-29 11:30:40
114Bioinformatics / Sequence motif / DNA binding site / Algorithm / Motif / Multiple sequence alignment / Teiresias algorithm / NP / Planted motif search / Multiple EM for Motif Elicitation

Genome Informatics 15(2): 63–An Extension and Novel Solution to the (l,d )–Motif Challenge Problem

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2004-12-26 23:38:46
115Abstract data types / Search algorithms / Hashing / Arrays / Hash table / Collection / Garbage collection / Sorting algorithm / Ruby / Algorithm / Hash function / Trie

Data Structures and Algorithms with Object-Oriented Design Patterns in Ruby Data Structures and Algorithms with Object-Oriented Design Patterns in Ruby

Add to Reading List

Source URL: www.brpreiss.com

Language: English - Date: 2014-07-08 21:38:40
116Alphabet Inc. / Data analysis / Google Flu Trends / Influenza / Prediction / Data management / Google Search / Big data / Glasgow Film Theatre / Google / Centers for Disease Control and Prevention / Algorithm

FINAL FINAL POLICYFORUM BIG DATA

Add to Reading List

Source URL: scholar.harvard.edu

Language: English - Date: 2014-03-13 14:35:06
117Search algorithms / Data mining / K-nearest neighbors algorithm / Machine learning / Numerical analysis / Statistical tests / Outlier / Receiver operating characteristic / XTR / Statistical hypothesis testing / Normal distribution / Curse of dimensionality

Using mutual proximity for novelty detection in audio music similarity Arthur Flexer? and Dominik Schnitzer Austrian Research Institute for Artificial Intelligence Freyung 6/6, Vienna, Austria

Add to Reading List

Source URL: www.ecmlpkdd2013.org

Language: English - Date: 2013-10-31 16:17:08
118Recommender systems / Search algorithms / Bipartite graph / K-nearest neighbors algorithm / Collaborative filtering

Being prepared in a sparse world: the case of KNN graph construction Antoine Boutet Anne-Marie Kermarrec

Add to Reading List

Source URL: womencourage.acm.org

Language: English - Date: 2016-08-09 09:13:46
119Information theory / Randomness / Search algorithms / Statistical theory / Philosophy of thermal and statistical physics / Entropy / K-nearest neighbors algorithm / Nearest neighbor search

Estimating the Entropy of Natural Scenes from Nearest Neighbors using CUDA Paul Ivanov Vision Science Graduate Program Redwood Center for Theoretical Neuroscience University of California, Berkeley Method

Add to Reading List

Source URL: www.nvidia.com

Language: English - Date: 2009-10-14 18:42:21
120NP-complete problems / Computational complexity theory / Analysis of algorithms / Operations research / NP-hard problems / Vertex cover / Travelling salesman problem / Dynamic programming / Parameterized complexity / Independent set / Algorithm / 2-satisfiability

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-15 10:47:56
UPDATE